Semidirect Sums of Matroids
نویسنده
چکیده
For matroids M and N on disjoint sets S and T , a semidirect sum of M and N is any matroid K on S ∪ T that, like the direct sum and the free product, has the restrictionK|S equal toM and the contractionK/S equal toN . We abstract a matrix construction to get a general matroid construction: the matroid union of any rank-preserving extension ofM on the set S ∪ T with the direct sum ofN and the rank-0 matroid on S is a semidirect sum of M and N . We study principal sums in depth; these are such matroid unions where the extension of M has each element of T added either as a loop or freely on a fixed flat of M . A second construction of semidirect sums, defined by a Higgs lift, also specializes to principal sums. We also explore what can be deduced if M and N , or certain of their semidirect sums, are transversal or fundamental transversal matroids. To James Oxley on his 60th birthday 1. BLOCK UPPER-TRIANGULAR MATRICES AND SEMIDIRECT SUMS A simple way to combine two matricesA andB over a field F is to have them be blocks of a block-diagonal matrix. A richer collection of matrices results by putting a third matrix U over F in the upper right corner to obtain a block upper-triangular matrix (A,B;U), where (A,B;U) = (
منابع مشابه
Thin sums matroids and duality
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families are precisely the duals of representable matroids (those arising from vector spaces). We also show that the class of tame thin sums matroids is closed under du...
متن کاملAn Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملM ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملAn excluded minors method for infinite matroids
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...
متن کاملMatroids with an infinite circuit-cocircuit intersection
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress does not axiomatize all infinite matroids. We show that one of the matroids we define is a thin sums matroid whose dual isn’t a thin sums matroid.
متن کامل